Theoretical and algorithmic results for a class of hierarchical fleet mix problems
نویسندگان
چکیده
In this paper a hierarchical workforce model is studied from both a theoretical and an algorithmic point of view. In the considered model workforce units can be substituted by higher qualified ones; external workforce can also be hired to cover low qualified jobs. An exact solution algorithm is proposed to solve the problems and its efficiency is improved by means of cut conditions and discrete convexity properties. Finally, the results of a computational test are provided.
منابع مشابه
Three New Heuristic Algorithms For The Fleet Size And Mix Green Vehicle Routing Problem
In recent years, great efforts have been made to reduce greenhouse gas emissions by vehicles. Petroleum products produces greenhouse gas emissions, therefore reducing the use of these products can make a major contribution to reducing pollution. The Fleet Size and Mix Vehicle Routing Problem is one of the most widely used routing branches. In this problem, there are vehicle with different capac...
متن کاملAn Integrated Approach for Facility Location and Supply Vessel Planning with Time Windows
This paper presents a new model of two-echelon periodic supply vessel planning problem with time windows mix of facility location (PSVPTWMFL-2E) in an offshore oil and gas industry. The new mixed-integer nonlinear programming (MINLP) modelconsists ofa fleet composition problem and a location-routing problem (LRP). The aim of the model is to determine the size and type of large vessels in the fi...
متن کاملA multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملComputational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by algorithmic problems in the domain of information security, we study the complexity of a new class of computations over sets of elements. In this paper, we introduce hierarchical data processing, a generic class of problems for which, broadly speaking, the computation of a collection of output values from an input set of n elements is fully described by a directed acyclic graph (DA...
متن کاملA Model for Considering the ‘total Safety’ of the Light Passenger Vehicle Fleet
This report describes the results of research to develop and apply a comprehensive model to consider the influence of the mix of vehicle types on the total safety of the light passenger vehicle fleet in Australia. Key inputs to the model are estimates of the crashworthiness and aggressivity of light passenger vehicles in the key crash types representing the majority of crashes in which these ve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- European Journal of Operational Research
دوره 198 شماره
صفحات -
تاریخ انتشار 2009